Linear Complexity and Autocorrelation of Prime Cube Sequences
نویسندگان
چکیده
We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p, where p is an odd prime. Linear complexities, minimal polynomials and autocorrelation of these sequences are computed.
منابع مشابه
Autocorrelation of New Generalized Cyclotomic Sequences of Period pn
Let n ≥ 2 be a positive integer and Z× n be the multiplicative group of the integer ring Zn. For a partition {Di|i = 0, 1, · · · , d − 1} of Z× n , if there exist elements g1, · · · , gd of Z× n satisfying Di = giD0 for all i where D0 is a multiplicative subgroup of Z× n , the Di are called generalized cyclotomic classes of order d. There have been lots of studies about cyclotomy with respect t...
متن کاملThe Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...
متن کاملOn the Linear Complexity of Sidel'nikov Sequences over Fd
We study the linear complexity of sequences over the prime field Fd introduced by Sidel’nikov. For several classes of period length we can show that these sequences have a large linear complexity. For the ternary case we present exact results on the linear complexity using well known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملCyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
Abstract. BinaryWhiteman’s cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman’s generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that the autocorrelation values of this sequence is four-valued or five-valued if (n1−1)(n2−1)/36...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007